On Implementing a Configware/Software SAT Solver
نویسندگان
چکیده
This paper presents an implementation of the configware/software SAT solver proposed in FCCM'O1 [11. This is the first actually implemented hardware accelerated solver that can dispense with instance-specific compilation, and is capable of handling SAT formulas of virtually any size.
منابع مشابه
Solving SAT with a Context-Switching Virtual Clause Pipeline and an FPGA Embedded Processor
This paper proposes an architecture that combines a contextswitching virtual configware/software SAT solver with an embedded processor to promote a tighter coupling between configware and software. The virtual circuit is an arbitrarily large clause pipeline, partitioned into sections of a number of stages (hardware pages), which can fit in the configware. The hardware performs logical implicati...
متن کاملA Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic
In this paper, we present a hybrid method for deciding problems involving integer and Boolean variables which is based on generic SAT solving techniques augmented with a) a polynomial-time ILP solver for the special class of Unit-Two-Variable-Per-Inequality (unit TVPI or UTVPI) constraints and b) an independent solver for general integer linear constraints. In our approach, we present a novel m...
متن کاملMarch_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver
This paper discusses several techniques to make the lookahead architecture for satisfiability (Sat) solvers more competitive. Our contribution consists of reduction of the computational costs to perform look-ahead and a cheap integration of both equivalence reasoning and local learning. Most proposed techniques are illustrated with experimental results of their implementation in our solver marc...
متن کاملA Pearl on SAT Solving in Prolog (extended abstract)∗
The Boolean satisfiability problem, SAT, is of continuing interest because a variety of problems are naturally expressible as a SAT instance. Much effort has been expended in the development of algorithms for, and implementations of, efficient SAT solvers. This has borne fruit with a number of solvers that are either for specialised applications or are general purpose. Recently, it has been dem...
متن کاملCADICAL, LINGELING, PLINGELING, TREENGELING and YALSAT Entering the SAT Competition 2017
This paper serves as a first solver description for our new SAT solver CADICAL and documents the versions of our other solvers submitted to the SAT Competition 2017, which are LINGELING, its two parallel variants TREENGELING and PLINGELING, and our local search solver YALSAT. LINGELING,PLINGELING, TREENGELING,YALSAT Our focus in the SAT Competition 2016 was on our new SAT solver SPLATZ [1]. It ...
متن کامل